Welcome Guest

Questions for GLOBAL LOGIC


Aptitude And Technical Questions For GLOBAL LOGIC
           View All Aptitude And Technical Questions
Q. No. : 1
Question :X's father's wife's father's granddaughter uncle will be related to X as
A :
Son
B :
Nephew
C :
Uncle
D :
Grandfather
Answer: C
Q. No. : 2
Question : Father's age is five times his son's age.
Four years back father was 9 times older than his son. Find their present ages
A :
30yrs, 6yrs
B :
25yrs, 5yrs

C :
40yrs, 8yrs

D :
none of these
Answer: C
Q. No. : 3
Question :If out of X bulbs y bulbs are broken;The % of non broken bulbs
A :
(x+y) / x*100
B :
(x-y) / x*100
C :
(x-y) / y*100
D :
x/ y*100
Answer: B
Q. No. : 4
Question : All the pages of a book starting from page 1 are summed. One of the pages has been added twice, and the total thus obtained is 1000. Which is the page that has been added twice ?
A :
10
B :
12
C :
14
D :
none of these
Answer: A
Solution
Q. No. : 5
Question :A rectangular field is to be fenced on three sides leaving a side of 20 feet uncovered. If the area of the field is 680 sq. feet, how many feet of fencing will be required?
A :
34
B :
40
C :
68
D :
88
Answer: D
Solution
Q. No. : 6
Question :
main()
{
static int x[]={1,2,3,4,5,6,7,8};
int i;
for(i=2;i<6;++i)
x[x[i]]=x[i];
for(i=0;i<8;++i)
printf("%d",x[i]);
}
A :
1 2 3 3 4 4 7 8
B :
1 2 3 4 5 6 7 8
C :
8 7 6 5 4 3 2 1
D :
1 2 3 5 4 6 7 8
Answer: A
Q. No. : 7
Question :Find the output for the following C program
 int i =10 main()
 {
int i =20,n;
for(n=0;n<=i;)
{
int i=10; i++;
}
printf("%d", i);
}

A :
10
B :
garbage value
C :
20
D :
compilation error
Answer: C
Q. No. : 8
Question :A function q that accepts a pointer to a character as argument and returns a pointer to an array of integer can be declared as
A :
int(*q(char*))[]
B :
int *q(char *)[]
C :
int (*q)(char *)[]
D :
none of the above
Answer: A
Q. No. : 9
Question :The for loop
for(i=0;i<10;++i)
printf("%d",i&1);

prints
A :
0101010101
B :
0111111111
C :
0000000000
D :
1111111111
Answer: A
Q. No. : 10
Question :Consider the declaration

int a=5,*b=&a;
The statement
printf("%D",a*b);

prints
A :
25
B :
garbage
C :
5 x address of b
D :
an error message
Answer: D
Solution
Q. No. : 11
Question :3. Which of the following data structures are indexed structures?
A :
linear arrays
B :
linked lists
C :
both of above
D :
none of above
Answer: A
Q. No. : 12
Question :In an array representation of binary tree the right child of root will be at location of
A :
2
B :
5
C :
3
D :
0
Answer: C
Q. No. : 13
Question :The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
A :
0
B :
5
C :
10
D :
15
Answer: C
Solution
Q. No. : 14
Question :In linked lists there are no NULL links in:
A :
Sin­gle linked list
B :
Lin­ear dou­bly linked list
C :
cir­cu­lar linked list
D :
None of the above
Answer: C
Q. No. : 15
Question : The total number of comparisons in a bubble sort is
A :
O(n log n)
B :
O(2n)
C :
O(n2)
D :
None of the above
Answer: C
Q. No. : 16
Question :A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
A :
Quick Sort
B :
Heap Sort
C :
Merge Sort
D :
Insert Sort
Answer: A
Q. No. : 17
Question :The merging two sorted lists of size m and n into a sorted lists of size m+n , we require comparisions of
A :
O(m)
B :
O(n)
C :
O(m+n)
D :
O(log(m)+log(n))
Answer: C
Q. No. : 18
Question :Time complexity of AVL tree is
A :
N*N

B :
log(N)
C :
N*log(N)

D :
N
Answer: B
Q. No. : 19
Question :Which of the following sorting algorithm has the worst time complexity of nlog(n)
A :
Heap Sort
B :
Quick Sort
C :
Insertion Sort
D :
Selection Sort
Answer: A
Q. No. : 20
Question :Given two sorted list of size m and respectively. The number of comparisons needed in the worst case by merge sort will be
A :
mXn
B :
maximum of m and n
C :
minimum of m and n
D :
m+n-1
Answer: D
Q. No. : 21
Question :Which of the following cannot be declared static?
A :
Class
B :
inline function
C :
Functions
D :
Member variables
Answer: A
Q. No. : 22
Question :Choose the correct statement regarding inline functions
A :
It speeds up execution
B :
It slows down the execution
C :
It increases the code size
D :
It decreases the code size
Answer: C
Q. No. : 23
Question :Which of the following parameter passing mechanism is/are supported by C++,but not by C?
A :
Pass by value
B :
Pass by reference
C :
Pass by value result
D :
All of the above
Answer: B